Sharp Bounds for the Tails of Functionals of Markov Chains
نویسنده
چکیده
This paper is devoted to establishing sharp bounds for deviation probabilities of partial sums Σi=1f(Xi), where X = (Xn)n2N is a positive recurrent Markov chain and f is a real valued function defined on its state space. Combining the regenerative method to the Esscher transformation, these estimates are shown in particular to generalize probability inequalities proved in the i.i.d. case to the Markovian setting for (not necessarily uniformly) geometrically ergodic chains. AMS 2000 subject classification: Primary 60E15, 60J27, Secondary 60K05.
منابع مشابه
Stochastic bounds for a single server queue with general retrial times
We propose to use a mathematical method based on stochastic comparisons of Markov chains in order to derive performance indice bounds. The main goal of this paper is to investigate various monotonicity properties of a single server retrial queue with first-come-first-served (FCFS) orbit and general retrial times using the stochastic ordering techniques.
متن کاملThe Scaling Limit of Senile Reinforced Random Walk
Abstract We prove that the scaling limit of nearest-neighbour senile reinforced random walk is Brownian Motion when the time T spent on the first edge has finite mean. We show that under suitable conditions, when T has heavy tails the scaling limit is the so-called fractional kinetics process, a random time-change of Brownian motion. The proof uses the standard tools of time-change and invarian...
متن کاملLarge Deviations and Full Edgeworth Expansions for Finite Markov Chains with Applications to the Analysis of Genomic Sequences
To establish lists of words with unexpected frequencies in long sequences, for instance in a molecular biology context, one needs to quantify the exceptionality of families of word frequencies in random sequences. To this aim, we study large deviation probabilities of multidimensional word counts for Markov and hidden Markov models. More specifically, we compute local Edgeworth expansions of ar...
متن کاملEmpirical Bayes Estimation in Nonstationary Markov chains
Estimation procedures for nonstationary Markov chains appear to be relatively sparse. This work introduces empirical Bayes estimators for the transition probability matrix of a finite nonstationary Markov chain. The data are assumed to be of a panel study type in which each data set consists of a sequence of observations on N>=2 independent and identically dis...
متن کاملThe Rate of Rényi Entropy for Irreducible Markov Chains
In this paper, we obtain the Rényi entropy rate for irreducible-aperiodic Markov chains with countable state space, using the theory of countable nonnegative matrices. We also obtain the bound for the rate of Rényi entropy of an irreducible Markov chain. Finally, we show that the bound for the Rényi entropy rate is the Shannon entropy rate.
متن کامل